// Copyright 2007-2009, Stanford University. All Rights Reserved.
// Copyright 2010-2011, Dependable Systems Lab, EPFL. All Rights Reserved.
// Copyright 2012, Google Inc. All Rights Reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimers.
//     * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimers
// in the documentation and/or other materials provided with the
// distribution.
//     * Neither the names of the klee Team, Stanford University, nor the
// names of its contributors may be used to endorse or promote
// products derived from the software without specific prior
// written permission. Neither the names of the Dependable Systems
// Laboratory, EPFL, nor the names of its contributors may be used to
// endorse or promote products derived from the software without prior
// written permission. Neither the names of Google Inc. nor the names of
// its contributors may be used to endorse or promote products derived from
// the software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

#ifndef SRC_EXPR_EXPRHASHMAP_H_
#define SRC_EXPR_EXPRHASHMAP_H_

#include "expr/Expr.h"
#include <tr1/unordered_map>
#include <tr1/unordered_set>

namespace seven_summits {
namespace util {

template<class T> class ref;

}  // namespace util
}  // namespace seven_summits


namespace seven_summits {
namespace expr {

struct ExprHash  {
  unsigned operator()(const ref<Expr> e) const {
    return e->hash();
  }
};

struct ExprCmp {
  bool operator()(const ref<Expr> &a, const ref<Expr> &b) const {
    return a==b;
  }
};

struct UpdateListHash {
  unsigned operator()(const UpdateList &ul) const {
    return ul.hash();
  }
};

struct UpdateListCmp {
  bool operator()(const UpdateList &a, const UpdateList &b) const {
    return a.compare(b);
  }
};

template<class T>
class ExprHashMap :
  public std::tr1::unordered_map<util::ref<Expr>,
         T,
         ExprHash,
         ExprCmp> {
};

typedef std::tr1::unordered_set<util::ref<Expr>,
        ExprHash,
        ExprCmp> ExprHashSet;

template<class T>
class UpdateListHashMap :
  public std::tr1::unordered_map<UpdateList,
         T,
         UpdateListHash,
         UpdateListCmp> {

  };

typedef std::tr1::unordered_set<UpdateList,
        UpdateListHash,
        UpdateListCmp> UpdateListHashSet;

}  // namespace expr
}  // namespace seven_summits
#endif  // SRC_EXPR_EXPRHASHMAP_H_
